Approximate solutions for a stochastic lot-sizing problem with partial customer-order information
نویسندگان
چکیده
We address a stochastic single item production system in a make-to-stock environment with partial knowledge on future demand resulting from customers ordering in advance of their actual needs. The problem consists of determining the optimal size of a production lot to replenish inventory, so that delivery promises are met on time at the expense of minimal average costs. For this problem an optimal policy is formulated. However, since the optimal policy is likely to be too complex in most practical situations, we present approximate strategies for obtaining production lot sizes. The well-known (R, S) inventory policy is compared to two rules where production decisions take into account the available information on future customer requirements and the probabilistic characterisation of orders yet to be placed. It is shown that the (8, S) inventory policy is a special case of one of the rules. An extensive numerical study reveals that the newly developed strategies outperform the classical ones.
منابع مشابه
OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملSimultaneous Due Date Assignment and Lot Sizing with Uncertain Flow Times
Due date assignment for customer orders has been studied in various productionenvironments using different modeling approaches. In this paper the researchers consider aproduction system in which the orders of several customers are produced in a single batch because ofthe economy of scale. If a batch is completed before receiving customer orders, inventory carryingcost is incurred but if it is c...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملFuzzy Mathematical Model For A Lot-Sizing Problem In Closed-Loop Supply Chain
The aim of lot sizing problems is to determine the periods where production takes place and the quantities to be produced in order to satisfy the customer demand while minimizing the total cost. Due to its importance on the efficiency of the production and inventory systems, Lot sizing problems are one of the most challenging production planning problems and have been studied for many years wit...
متن کاملA Vibration Damping Optimization Algorithm for Solving the Single-item Capacitated Lot-sizing Problem with Fuzzy Parameters
In this paper, we propose a vibration damping optimization algorithm to solve a fuzzy mathematical model for the single-item capacitated lot-sizing problem. At first, a fuzzy mathematical model for the single-item capacitated lot-sizing problem is presented. The possibility approach is chosen to convert the fuzzy mathematical model to crisp mathematical model. The obtained crisp model is in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 150 شماره
صفحات -
تاریخ انتشار 2003